On neighbourly triangulations
نویسندگان
چکیده
منابع مشابه
Neighbourly Regular Strength of Bipartite Graphs
A graph is said to be a neighbourly irregular graph (or simply an NI graph) if every pair of its adjacent vertices have distinct degrees. Let G be a simple graph of order n. Let NI(G) denote the set of all NI graphs in which G is an induced subgraph. The neighbourly regular strength of G is denoted by NRS(G) and is defined as the minimum positive integer k for which there is an NI graph in NI(G...
متن کاملMinuscule posets from neighbourly graph sequences
We begin by associating to any sequence of vertices in a simple graph X, here always assumed connected, a partially ordered set called a heap. This terminology was introduced by Viennot ([11]) and used extensively by Stembridge in the context of fully commutative elements of Coxeter groups (see [8]), but our context is more general and graph-theoretic. The heap of a sequence of vertices is that...
متن کاملStability Properties of Neighbourly Random Polytopes
We introduce a quantitative parameter measuring m-neighbourliness of symmetric convex polytopes in R . We discuss this parameter for random polytopes generated by subgaussian vectors and show its stability properties.
متن کاملAnalysis on Triangulations
We develop structures associated with triangulations which permit the application, directly to the vertices of a triangulation, of tools and processes normally restricted to continuous data, or at least data of sufficiently fine resolution and precision that the approximations of numerical analysis yield reasonable results. These structures include polynomial surfaces associated with, and refle...
متن کاملOn Hamiltonian Triangulations in
An n-vertex simple polygon P is said to have a Hamilto-nian Triangulation if it has a triangulation whose dual graph contains a Hamiltonian path. Such triangulations are useful in fast rendering engines in Computer Graphics. We give a new characterization of polygons with Hamiltonian triangulations. and use it to devise O(n log n)-time algorithms to recognize such polygons.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1983
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1983-0690049-0